Modalities for model checking: branching time logic strikes back
نویسندگان
چکیده
منابع مشابه
Modalities for Model Checking: Branching Time Logic Strikes Back
We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be viewed as a finite (Kripke) structure, and a model checking algorithm can be given for determining if a given structure is a model of a specification expressed in a propositional temporal logic. In this paper, we present a unified approach for efficient model checking under a ...
متن کاملA Partial Order Approach to Branching Time Logic Model Checking
Part.ial order t.echniques enable reducing the size of I.Iw sl,ate gtoaph used for model checking, thus alleviating the 'state space explosion' problem. Tilt'sf.' reductions are based on selecting a subset of the enabled operations from each program 51.ale. So far. these methods have been studied, implemel~ted and demonst.rat.ed fol' assertional langllagcs t.hat. model t.he executions of a prog...
متن کاملOracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle. This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.
متن کاملModel Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL∗. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimisations are considered to obtain model checking games for impo...
متن کاملModel checking dynamic epistemics in branching time
We give a relation between a logic of knowledge and change, with a semantics on Kripke models, and a logic of knowledge and time, with a semantics on interpreted systems. More in particular, given an epistemic state and a formula in action model logic, we construct an interpreted system relative to that epistemic state and that formula that satisfies the translation of the formula into branchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1987
ISSN: 0167-6423
DOI: 10.1016/0167-6423(87)90036-0